Continuation Semantics Values, Contexts and Computations
نویسنده
چکیده
A promising line of research in the interaction between syntax and semantics has been open by the work on Continuation Semantics started by [1] and [5] and further explored by [8]. Work done within Curry Howard Correspondence to Classical Logic has brought to the attention the duality distinction holding between terms and contexts (or co-terms), and can help further shaping the syntax-semantics interface and the connection between natural and formal languages as shown in [3, 4]. This duality is clearly explained in [7]:
منابع مشابه
A Theory of Speculative Computation
We propose a formal definition for (valid) speculative computations, which is independent of any implementation technique. By speculative computations we mean optimization mechanisms that rely on relaxing the flow of execution in a given program, and on guessing the values read from pointers in the memory. Our framework for formalizing these computations is the standard operational one that is ...
متن کاملA duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملProving termination of evaluation for System F with control operators
We present new proofs of termination of evaluation in reduction semantics (i.e., a small-step operational semantics with explicit representation of evaluation contexts) for System F with control operators. We introduce a modified version of Girard’s proof method based on reducibility candidates, where the reducibility predicates are defined on values and on evaluation contexts as prescribed by ...
متن کاملContinuations for Prototyping Concurrent Languages
We have recently introduced the “continuation semantics for concurrency” (CSC) technique in an attempt to exploit the benefits of using continuations in concurrent systems development. In the CSC approach, a continuation is an application-dependent configuration of computations (partially evaluated denotations). Every computation or group of computations contained in a continuation can be acces...
متن کاملA Context-based Approach to Proving Termination of Evaluation
We show a context-based approach to proving termination of evaluation in reduction semantics (i.e., a form of operational semantics with explicit representation of reduction contexts), using Tait-style reducibility predicates defined on both terms and contexts. We consider the simply typed lambda calculus as well as its extension with abortive control operators for first-class continuations und...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009